On the Homomorphism Theorem for Semirings
نویسندگان
چکیده
منابع مشابه
The Cayley-Hamilton Theorem for Noncommutative Semirings
The Cayley-Hamilton theorem (CHT) is a classic result in linear algebra over fields which states that a matrix satisfies its own characteristic polynomial. CHT has been extended from fields to commutative semirings by Rutherford in 1964. However, to the best of our knowledge, no result is known for noncommutative semirings. This is a serious limitation, as the class of regular languages, with f...
متن کاملA Fundamental Theorem of Homomorphisms for Semirings
1. Introduction. When studying ideal theory in semirings, it is natural to consider the quotient structure of a semiring modulo an ideal. If 7 is an ideal in a semiring R, the collection {x+l}xeit oí sets x + I={x+i\iEl} need not be a partition of R. Faced with this problem, [2] used equivalence relations to determine cosets relative to an ideal. La Torre successfully established analogues of s...
متن کاملA homomorphism theorem for bilinear multipliers
In this paper we prove an abstract homomorphism theorem for bilinear multipliers in the setting of locally compact Abelian (LCA) groups. We also provide some applications. In particular, we obtain a bilinear abstract version of K. de Leeuw’s theorem for bilinear multipliers of strong and weak type. We also obtain necessary conditions on bilinear multipliers on non-compact LCA groups, yielding b...
متن کاملA Dichotomy Theorem for Homomorphism Polynomials
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H . We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edge and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P ). We...
متن کاملA Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
In the constraint satisfaction problem (CSP ), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem (MinHom), one is additionally given weights cva for every variable v and value a, and the aim is to find an assignment f to the variables that minimizes ∑ v cvf(v). Let MinHom (Γ) denote the MinHom problem para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1952
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.38.2.118